By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Discrete Mathematics

Table of Contents
Search This Issue
Volume 15, Issue 4, pp. 435-575

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Approximating Bandwidth by Mixing Layouts of Interval Graphs

D. Kratsch. and L. Stewart

pp. 435-449

BibTeX  Abstract Full Text:  PDF

Scheduling Unrelated Machines by Randomized Rounding

Andreas S. Schulz and Martin Skutella

pp. 450-469

BibTeX  Abstract Full Text:  PDF

On the Facet-Inducing Antiweb-Wheel Inequalities for Stable Set Polytopes

Eddie Cheng and Sven de Vries

pp. 470-487

BibTeX  Abstract Full Text:  PDF

Characterization of Efficiently Parallel Solvable Problems on Distance-Hereditary Graphs

Sun-Yuan Hsieh, Chin-Wen Ho, Tsan-Sheng Hsu, Ming-Tat Ko, and Gen-Huey Chen

pp. 488-518

BibTeX  Abstract Full Text:  PDF

Domination in Graphs Applied to Electric Power Networks

Teresa W. Haynes, Sandra M. Hedetniemi, Stephen T. Hedetniemi, and Michael A. Henning

pp. 519-529

BibTeX  Abstract Full Text:  PDF

Robust Matchings

Refael Hassin and Shlomi Rubinstein

pp. 530-537

BibTeX  Abstract Full Text:  PDF

Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles

Wei-Fan Wang and Ko-Wei Lih

pp. 538-545

BibTeX  Abstract Full Text:  PDF

A Fast Algorithm for Generating Nonisomorphic Chord Diagrams

Joe Sawada

pp. 546-561

BibTeX  Abstract Full Text:  PDF

Inverting Random Functions II: Explicit Bounds for Discrete Maximum Likelihood Estimation, with Applications

Michael A. Steel and László A. Székely

pp. 562-575

BibTeX  Abstract Full Text:  PDF